- convex region
- выпуклая область
English-Russian dictionary of computer science. 2015.
English-Russian dictionary of computer science. 2015.
Convex function — on an interval. A function (in black) is convex if and only i … Wikipedia
Convex optimization — Convex minimization, a subfield of optimization, studies the problem of minimizing convex functions over convex sets. Given a real vector space X together with a convex, real valued function defined on a convex subset of X, the problem is to find … Wikipedia
Convex set — A convex set … Wikipedia
Local convex hull — (LoCoH) is a method for estimating the size the home range of an animal or a group of animals (e.g. a pack of wolves, a pride of lions, or herd of buffalos), and for constructing a utilization distribution. [Getz, W. M. and C. C. Wilmers, 2004. A … Wikipedia
Pseudotriangle — In Euclidean plane geometry, a pseudotriangle is the simply connected subset of the plane that lies between any three mutually tangent convex sets. A pseudotriangulation is a partition of a region of the plane into pseudotriangles, and a pointed… … Wikipedia
Support polygon — For a rigid object in contact with a fixed environment and acted upon by gravity in the vertical direction, its support polygon is a horizontal region over which the center of mass must lie to achieve static stability. For example, for an object… … Wikipedia
Kepler–Poinsot polyhedron — In geometry, a Kepler–Poinsot polyhedron is any of four regular star polyhedra. They may be obtained by stellating the regular convex dodecahedron and icosahedron, and differ from these in having regular pentagrammic faces or vertex figures.… … Wikipedia
Dome (mathematics) — In mathematics, a dome is a closed geometrical surface which can be obtained by sectioning off a portion of a sphere with an intersecting plane. It consists of two parts: (1) a flat disk, which is joined to (2) a convex surface whose curvature is … Wikipedia
Tarski's plank problem — In mathematics, Tarski s plank problem is a question about coverings of convex regions in n dimensional Euclidean space by planks : regions between two hyperplanes. Tarski asked if the sum of the widths of the planks must be at least the minimum… … Wikipedia
Packing problem — Part of a series on Puzzles … Wikipedia
Affine connection — An affine connection on the sphere rolls the affine tangent plane from one point to another. As it does so, the point of contact traces out a curve in the plane: the development. In the branch of mathematics called differential geometry, an… … Wikipedia